Deterministic Extractors for Algebraic Sources
نویسنده
چکیده
An algebraic source is a random variable distributed uniformly over the set of common zeros of one or more multivariate polynomials defined over a finite field F. Our main result is the construction of an explicit deterministic extractor for algebraic sources over exponentially large prime fields. More precisely, we give an explicit (and arguably simple) function E : Fn 7→ {0, 1}m such that the output of E on any algebraic source in Fn is close to the uniform distribution, provided that the degrees of the defining polynomials are not too high and that the algebraic source contains ‘enough’ points. This extends previous works on extraction from affine sources (sources distributed over subspaces) and from polynomial sources (sources defined as the image of a low degree polynomial mapping). We also give an additional construction of a deterministic extractor for algebraic sources with support larger than |F|n/2. This construction works over fields as small as dO(1), where d is the maximal degree of a polynomial used to define the source.
منابع مشابه
Deterministic Extraction from Weak Random Sources - Preamble
Preface Roughly speaking, a deterministic extractor is a function that 'extracts' almost perfect random bits from a 'weak random source'-a distribution that contains some entropy but is far from being truly random. In this book we explicitly construct deterministic extractors and related objects for various types of sources. A basic theme in this book is a methodology of recycling randomness th...
متن کاملAn Introduction to Randomness Extractors
We give an introduction to the area of “randomness extraction” and survey the main concepts of this area: deterministic extractors, seeded extractors and multiple sources extractors. For each one we briefly discuss background, definitions, explicit constructions and applications.
متن کاملDeterministic Extractors - Lecture Notes
Randomness is used in many places in our daily lives. Some examples are gambling, statistics, algorithms, cryptography etc. For such applications one typically assumes a supply of completely unbiased and independent randim bits. This raises the problem of where to get these assumed random bits from. We could try and use natural sources of randomness such as sun spots, the stock market or the we...
متن کاملExtractors for Affine Sources with Polylogarithmic Entropy
We give the first explicit construction of deterministic extractors for affine sources over F2, with entropy k ≥ log n for some large enough constant C, where n is the length of the source. Previously the best known results are by Bourgain [Bou07], Yehudayoff [Yeh11] and Li [Li11b], which require the affine source to have entropy at least Ω(n/ √ log log n). Our extractor outputs one bit with er...
متن کاملExtractors for Turing-Machine Sources
We obtain the first deterministic randomness extractors for n-bit sources with minentropy ≥ n1−α generated (or sampled) by single-tape Turing machines running in time n2−16α, for all sufficiently small α > 0. We also show that such machines cannot sample a uniform n-bit input to the Inner Product function together with the output. The proofs combine a variant of the crossing-sequence technique ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electronic Colloquium on Computational Complexity (ECCC)
دوره 15 شماره
صفحات -
تاریخ انتشار 2008